A Simple Transient Analysis of an M/m/1/n Queue
نویسنده
چکیده
SUMMARY. A simple series form is obtained for the transient state probabilities of a single server Markovian queue with finite waiting space whence all particular cases concerning infinite waiting space and steady-state situations can be derived straight away. Also the coefficients in the series satisfy iterative recurrence relations which enable fast and accurate numerical computations.
منابع مشابه
Transient Solution of an M/M/1 Variant Working Vacation Queue with Balking
This paper presents the transient solution of a variant working vacation queue with balking. Customers arrive according to a Poisson process and decide to join the queue with probability $b$ or balk with $bar{b} = 1-b$. As soon as the system becomes empty, the server takes working vacation. The service times during regular busy period and working vacation period, and vacation times are assumed ...
متن کاملAnalysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures
This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its re...
متن کاملM/M/1 Feedback Queue Subject to Catastrophe and Repairment
In this paper, an M/M/1 queue with instantaneous Bernoulli feedback is studied in the event of server failure, the catastrophe occurs and after repair, it starts to work again. The transient response for the probability function of the system size is presented. The steady state analysis of system size probabilities and some performance measures of system are provided. Then the resu...
متن کاملAnalysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
متن کاملA stochastic version analysis of an M/G/1 retrial queue with Bernoulli schedule
In this work, we derive insensitive bounds for various performance measures of a single-server retrial queue with generally distributed inter-retrial times and Bernoulli schedule, under the special assumption that only the customer at the head of the orbit queue (i.e., a FCFS discipline governing the flow from the orbit to the server) is allowed to occupy the server. The method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002